0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.12	% Command    : run_E %s %d THM
0.14/0.33	% Computer : n010.cluster.edu
0.14/0.33	% Model    : x86_64 x86_64
0.14/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.33	% Memory   : 8042.1875MB
0.14/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.33	% CPULimit   : 1440
0.14/0.33	% WCLimit    : 180
0.14/0.33	% DateTime   : Thu Jul  4 08:20:39 EDT 2024
0.14/0.34	% CPUTime    : 
0.21/0.48	Running higher-order theorem proving
0.21/0.49	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.GYlVdVKlsF/E---3.1_22406.p
0.88/0.59	# Version: 3.2.0-ho
0.88/0.59	# Preprocessing class: HSSSSLSSSLSNSFA.
0.88/0.59	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.88/0.59	# Starting post_as_ho5 with 900s (5) cores
0.88/0.59	# Starting post_as_ho10 with 180s (1) cores
0.88/0.59	# Starting post_as_ho4 with 180s (1) cores
0.88/0.59	# Starting sh5l with 180s (1) cores
0.88/0.59	# post_as_ho5 with pid 22500 completed with status 0
0.88/0.59	# Result found by post_as_ho5
0.88/0.59	# Preprocessing class: HSSSSLSSSLSNSFA.
0.88/0.59	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.88/0.59	# Starting post_as_ho5 with 900s (5) cores
0.88/0.59	# SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
0.88/0.59	# Search class: HGUNF-FFSF32-SSFFMSBN
0.88/0.59	# partial match(2): HGUNF-FFSF11-SSFFMSBN
0.88/0.59	# Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
0.88/0.59	# Starting post_as_ho12 with 361s (1) cores
0.88/0.59	# Starting new_ho_8 with 136s (1) cores
0.88/0.59	# Starting new_ho_4 with 136s (1) cores
0.88/0.59	# Starting post_as_ho5 with 136s (1) cores
0.88/0.59	# Starting post_as_ho4 with 131s (1) cores
0.88/0.59	# post_as_ho5 with pid 22509 completed with status 0
0.88/0.59	# Result found by post_as_ho5
0.88/0.59	# Preprocessing class: HSSSSLSSSLSNSFA.
0.88/0.59	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.88/0.59	# Starting post_as_ho5 with 900s (5) cores
0.88/0.59	# SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
0.88/0.59	# Search class: HGUNF-FFSF32-SSFFMSBN
0.88/0.59	# partial match(2): HGUNF-FFSF11-SSFFMSBN
0.88/0.59	# Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
0.88/0.59	# Starting post_as_ho12 with 361s (1) cores
0.88/0.59	# Starting new_ho_8 with 136s (1) cores
0.88/0.59	# Starting new_ho_4 with 136s (1) cores
0.88/0.59	# Starting post_as_ho5 with 136s (1) cores
0.88/0.59	# Preprocessing time       : 0.001 s
0.88/0.59	# Presaturation interreduction done
0.88/0.59	
0.88/0.59	# Proof found!
0.88/0.59	# SZS status Theorem
0.88/0.59	# SZS output start CNFRefutation
0.88/0.59	thf(decl_22, type, in: $i > $i > $o).
0.88/0.59	thf(decl_23, type, subset: $i > $i > $o).
0.88/0.59	thf(decl_24, type, subsetI1: $o).
0.88/0.59	thf(decl_25, type, kpair: $i > $i > $i).
0.88/0.59	thf(decl_26, type, cartprod: $i > $i > $i).
0.88/0.59	thf(decl_27, type, breln: $i > $i > $i > $o).
0.88/0.59	thf(decl_28, type, brelnall1: $o).
0.88/0.59	thf(decl_29, type, esk1_2: $i > $i > $i).
0.88/0.59	thf(decl_30, type, esk2_4: $i > $i > $i > ($i > $o) > $i).
0.88/0.59	thf(decl_31, type, esk3_4: $i > $i > $i > ($i > $o) > $i).
0.88/0.59	thf(decl_32, type, esk4_0: $i).
0.88/0.59	thf(decl_33, type, esk5_0: $i).
0.88/0.59	thf(decl_34, type, esk6_0: $i).
0.88/0.59	thf(decl_35, type, esk7_0: $i).
0.88/0.59	thf(breln, axiom, ((breln)=(^[X1:$i, X2:$i, X4:$i]:((subset @ X4 @ (cartprod @ X1 @ X2))))), file('/export/starexec/sandbox/tmp/tmp.GYlVdVKlsF/E---3.1_22406.p', breln)).
0.88/0.59	thf(brelnall1, axiom, ((brelnall1)<=>![X1:$i, X2:$i, X5:$i]:(((breln @ X1 @ X2 @ X5)=>![X6:$i > $o]:((![X3:$i]:(((in @ X3 @ X1)=>![X7:$i]:(((in @ X7 @ X2)=>((in @ (kpair @ X3 @ X7) @ X5)=>(X6 @ (kpair @ X3 @ X7)))))))=>![X3:$i]:(((in @ X3 @ X5)=>(X6 @ X3)))))))), file('/export/starexec/sandbox/tmp/tmp.GYlVdVKlsF/E---3.1_22406.p', brelnall1)).
0.88/0.59	thf(subbreln, conjecture, ((subsetI1)=>((brelnall1)=>![X1:$i, X2:$i, X5:$i]:((![X8:$i]:(((breln @ X1 @ X2 @ X8)=>(![X3:$i]:((![X7:$i]:(((in @ X7 @ X2)=>((in @ (kpair @ X3 @ X7) @ X5)=>(in @ (kpair @ X3 @ X7) @ X8))))<=(in @ X3 @ X1)))=>(subset @ X5 @ X8))))<=(breln @ X1 @ X2 @ X5))))), file('/export/starexec/sandbox/tmp/tmp.GYlVdVKlsF/E---3.1_22406.p', subbreln)).
0.88/0.59	thf(subsetI1, axiom, ((subsetI1)<=>![X1:$i, X2:$i]:((![X3:$i]:(((in @ X3 @ X1)=>(in @ X3 @ X2)))=>(subset @ X1 @ X2)))), file('/export/starexec/sandbox/tmp/tmp.GYlVdVKlsF/E---3.1_22406.p', subsetI1)).
0.88/0.59	thf(c_0_4, plain, ((breln)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((subset @ Z2 @ (cartprod @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[breln])).
0.88/0.59	thf(c_0_5, axiom, ((brelnall1)=(![X1:$i, X2:$i, X5:$i]:((((subset @ X5 @ (cartprod @ X1 @ X2)))=>![X6:$i > $o]:((![X3:$i]:(((in @ X3 @ X1)=>![X7:$i]:(((in @ X7 @ X2)=>((in @ (kpair @ X3 @ X7) @ X5)=>(X6 @ (kpair @ X3 @ X7)))))))=>![X3:$i]:(((in @ X3 @ X5)=>(X6 @ X3))))))))), inference(apply_def,[status(thm)],[brelnall1, c_0_4])).
0.88/0.59	thf(c_0_6, negated_conjecture, ~((![X25:$i, X26:$i]:((![X27:$i]:(((in @ X27 @ X25)=>(in @ X27 @ X26)))=>(subset @ X25 @ X26)))=>(![X28:$i, X29:$i, X30:$i]:(((subset @ X30 @ (cartprod @ X28 @ X29))=>![X31:$i > $o]:((![X32:$i]:(((in @ X32 @ X28)=>![X33:$i]:(((in @ X33 @ X29)=>((in @ (kpair @ X32 @ X33) @ X30)=>(X31 @ (kpair @ X32 @ X33)))))))=>![X34:$i]:(((in @ X34 @ X30)=>(X31 @ X34)))))))=>![X1:$i, X2:$i, X5:$i]:(((subset @ X5 @ (cartprod @ X1 @ X2))=>![X8:$i]:(((subset @ X8 @ (cartprod @ X1 @ X2))=>(![X3:$i]:(((in @ X3 @ X1)=>![X7:$i]:(((in @ X7 @ X2)=>((in @ (kpair @ X3 @ X7) @ X5)=>(in @ (kpair @ X3 @ X7) @ X8))))))=>(subset @ X5 @ X8))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[subbreln]), c_0_4]), subsetI1]), c_0_5])])).
0.88/0.59	thf(c_0_7, negated_conjecture, ![X35:$i, X36:$i, X38:$i, X39:$i, X40:$i, X41:$i > $o, X44:$i, X49:$i, X50:$i]:(((((in @ (esk1_2 @ X35 @ X36) @ X35)|(subset @ X35 @ X36))&(~(in @ (esk1_2 @ X35 @ X36) @ X36)|(subset @ X35 @ X36)))&((((in @ (esk2_4 @ X38 @ X39 @ X40 @ X41) @ X38)|(~(in @ X44 @ X40)|(X41 @ X44))|~(subset @ X40 @ (cartprod @ X38 @ X39)))&(((in @ (esk3_4 @ X38 @ X39 @ X40 @ X41) @ X39)|(~(in @ X44 @ X40)|(X41 @ X44))|~(subset @ X40 @ (cartprod @ X38 @ X39)))&(((in @ (kpair @ (esk2_4 @ X38 @ X39 @ X40 @ X41) @ (esk3_4 @ X38 @ X39 @ X40 @ X41)) @ X40)|(~(in @ X44 @ X40)|(X41 @ X44))|~(subset @ X40 @ (cartprod @ X38 @ X39)))&(~(X41 @ (kpair @ (esk2_4 @ X38 @ X39 @ X40 @ X41) @ (esk3_4 @ X38 @ X39 @ X40 @ X41)))|(~(in @ X44 @ X40)|(X41 @ X44))|~(subset @ X40 @ (cartprod @ X38 @ X39))))))&((subset @ esk6_0 @ (cartprod @ esk4_0 @ esk5_0))&((subset @ esk7_0 @ (cartprod @ esk4_0 @ esk5_0))&((~(in @ X49 @ esk4_0)|(~(in @ X50 @ esk5_0)|(~(in @ (kpair @ X49 @ X50) @ esk6_0)|(in @ (kpair @ X49 @ X50) @ esk7_0))))&~(subset @ esk6_0 @ esk7_0))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])])).
0.88/0.59	thf(c_0_8, negated_conjecture, ![X1:$i, X6:$i > $o, X4:$i, X3:$i, X2:$i]:(((X6 @ X4)|~((X6 @ (kpair @ (esk2_4 @ X1 @ X2 @ X3 @ X6) @ (esk3_4 @ X1 @ X2 @ X3 @ X6))))|~((in @ X4 @ X3))|~((subset @ X3 @ (cartprod @ X1 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.88/0.59	thf(c_0_9, negated_conjecture, ![X1:$i, X2:$i, X4:$i, X3:$i]:((((kpair @ (esk2_4 @ X1 @ X2 @ X3 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X4))))) @ (esk3_4 @ X1 @ X2 @ X3 @ (^[Z0/* 4 */:$i]:(((Z0)!=(X4))))))=(X4))|~((subset @ X3 @ (cartprod @ X1 @ X2)))|~((in @ X4 @ X3)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_8])).
0.88/0.59	thf(c_0_10, negated_conjecture, ![X1:$i, X2:$i]:(((in @ (esk1_2 @ X1 @ X2) @ X1)|(subset @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.88/0.59	thf(c_0_11, negated_conjecture, ![X1:$i, X6:$i > $o, X4:$i, X3:$i, X2:$i]:(((in @ (esk3_4 @ X1 @ X2 @ X3 @ X6) @ X2)|(X6 @ X4)|~((in @ X4 @ X3))|~((subset @ X3 @ (cartprod @ X1 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.88/0.59	thf(c_0_12, negated_conjecture, (subset @ esk6_0 @ (cartprod @ esk4_0 @ esk5_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.88/0.59	thf(c_0_13, negated_conjecture, ![X1:$i, X2:$i]:(((in @ (kpair @ X1 @ X2) @ esk7_0)|~((in @ X1 @ esk4_0))|~((in @ X2 @ esk5_0))|~((in @ (kpair @ X1 @ X2) @ esk6_0)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.88/0.59	thf(c_0_14, negated_conjecture, ![X1:$i, X4:$i, X3:$i, X2:$i]:((((kpair @ (esk2_4 @ X1 @ X2 @ X3 @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk1_2 @ X3 @ X4))))) @ (esk3_4 @ X1 @ X2 @ X3 @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk1_2 @ X3 @ X4))))))=(esk1_2 @ X3 @ X4))|(subset @ X3 @ X4)|~((subset @ X3 @ (cartprod @ X1 @ X2))))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.88/0.59	thf(c_0_15, negated_conjecture, ![X6:$i > $o, X1:$i]:(((in @ (esk3_4 @ esk4_0 @ esk5_0 @ esk6_0 @ X6) @ esk5_0)|(X6 @ X1)|~((in @ X1 @ esk6_0)))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.88/0.59	thf(c_0_16, negated_conjecture, ![X1:$i, X6:$i > $o, X4:$i, X3:$i, X2:$i]:(((in @ (esk2_4 @ X1 @ X2 @ X3 @ X6) @ X1)|(X6 @ X4)|~((in @ X4 @ X3))|~((subset @ X3 @ (cartprod @ X1 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.88/0.59	thf(c_0_17, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i]:(((in @ (esk1_2 @ X1 @ X2) @ esk7_0)|(subset @ X1 @ X2)|~((in @ (esk3_4 @ X3 @ X4 @ X1 @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk1_2 @ X1 @ X2))))) @ esk5_0))|~((in @ (esk2_4 @ X3 @ X4 @ X1 @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk1_2 @ X1 @ X2))))) @ esk4_0))|~((in @ (esk1_2 @ X1 @ X2) @ esk6_0))|~((subset @ X1 @ (cartprod @ X3 @ X4))))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.88/0.59	thf(c_0_18, negated_conjecture, ![X6:$i > $o, X1:$i]:(((in @ (esk3_4 @ esk4_0 @ esk5_0 @ esk6_0 @ X6) @ esk5_0)|(X6 @ (esk1_2 @ esk6_0 @ X1))|(subset @ esk6_0 @ X1))), inference(spm,[status(thm)],[c_0_15, c_0_10])).
0.88/0.59	thf(c_0_19, negated_conjecture, ![X6:$i > $o, X1:$i]:(((in @ (esk2_4 @ esk4_0 @ esk5_0 @ esk6_0 @ X6) @ esk4_0)|(X6 @ X1)|~((in @ X1 @ esk6_0)))), inference(spm,[status(thm)],[c_0_16, c_0_12])).
0.88/0.59	thf(c_0_20, negated_conjecture, ![X2:$i, X1:$i]:(((in @ (esk1_2 @ esk6_0 @ X1) @ esk7_0)|(subset @ esk6_0 @ X2)|(subset @ esk6_0 @ X1)|((esk1_2 @ esk6_0 @ X2)!=(esk1_2 @ esk6_0 @ X1))|~((in @ (esk2_4 @ esk4_0 @ esk5_0 @ esk6_0 @ (^[Z0/* 4 */:$i]:(((Z0)!=(esk1_2 @ esk6_0 @ X1))))) @ esk4_0)))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18])]), c_0_12])]), c_0_10])).
0.88/0.59	thf(c_0_21, negated_conjecture, ![X6:$i > $o, X1:$i]:(((in @ (esk2_4 @ esk4_0 @ esk5_0 @ esk6_0 @ X6) @ esk4_0)|(X6 @ (esk1_2 @ esk6_0 @ X1))|(subset @ esk6_0 @ X1))), inference(spm,[status(thm)],[c_0_19, c_0_10])).
0.88/0.59	thf(c_0_22, negated_conjecture, ![X3:$i, X2:$i, X1:$i]:(((in @ (esk1_2 @ esk6_0 @ X1) @ esk7_0)|(subset @ esk6_0 @ X2)|(subset @ esk6_0 @ X1)|(subset @ esk6_0 @ X3)|((esk1_2 @ esk6_0 @ X2)!=(esk1_2 @ esk6_0 @ X1))|((esk1_2 @ esk6_0 @ X3)!=(esk1_2 @ esk6_0 @ X1)))), inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21])])).
0.88/0.59	thf(c_0_23, negated_conjecture, ![X2:$i, X1:$i]:(((in @ (esk1_2 @ esk6_0 @ X1) @ esk7_0)|(subset @ esk6_0 @ X2)|(subset @ esk6_0 @ X1)|((esk1_2 @ esk6_0 @ X2)!=(esk1_2 @ esk6_0 @ X1)))), inference(er,[status(thm)],[c_0_22])).
0.88/0.59	thf(c_0_24, negated_conjecture, ![X1:$i, X2:$i]:(((subset @ X1 @ X2)|~((in @ (esk1_2 @ X1 @ X2) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.88/0.59	thf(c_0_25, negated_conjecture, ![X1:$i]:(((in @ (esk1_2 @ esk6_0 @ X1) @ esk7_0)|(subset @ esk6_0 @ X1))), inference(er,[status(thm)],[c_0_23])).
0.88/0.59	thf(c_0_26, negated_conjecture, ~((subset @ esk6_0 @ esk7_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.88/0.59	thf(c_0_27, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26]), ['proof']).
0.88/0.59	# SZS output end CNFRefutation
0.88/0.59	# Parsed axioms                        : 11
0.88/0.59	# Removed by relevancy pruning/SinE    : 7
0.88/0.59	# Initial clauses                      : 10
0.88/0.59	# Removed in clause preprocessing      : 0
0.88/0.59	# Initial clauses in saturation        : 10
0.88/0.59	# Processed clauses                    : 115
0.88/0.59	# ...of these trivial                  : 6
0.88/0.59	# ...subsumed                          : 10
0.88/0.59	# ...remaining for further processing  : 99
0.88/0.59	# Other redundant clauses eliminated   : 3
0.88/0.59	# Clauses deleted for lack of memory   : 0
0.88/0.59	# Backward-subsumed                    : 3
0.88/0.59	# Backward-rewritten                   : 0
0.88/0.59	# Generated clauses                    : 777
0.88/0.59	# ...of the previous two non-redundant : 685
0.88/0.59	# ...aggressively subsumed             : 0
0.88/0.59	# Contextual simplify-reflections      : 1
0.88/0.59	# Paramodulations                      : 726
0.88/0.59	# Factorizations                       : 12
0.88/0.59	# NegExts                              : 7
0.88/0.59	# Equation resolutions                 : 18
0.88/0.59	# Disequality decompositions           : 0
0.88/0.59	# Total rewrite steps                  : 68
0.88/0.59	# ...of those cached                   : 58
0.88/0.59	# Propositional unsat checks           : 0
0.88/0.59	#    Propositional check models        : 0
0.88/0.59	#    Propositional check unsatisfiable : 0
0.88/0.59	#    Propositional clauses             : 0
0.88/0.59	#    Propositional clauses after purity: 0
0.88/0.59	#    Propositional unsat core size     : 0
0.88/0.59	#    Propositional preprocessing time  : 0.000
0.88/0.59	#    Propositional encoding time       : 0.000
0.88/0.59	#    Propositional solver time         : 0.000
0.88/0.59	#    Success case prop preproc time    : 0.000
0.88/0.59	#    Success case prop encoding time   : 0.000
0.88/0.59	#    Success case prop solver time     : 0.000
0.88/0.59	# Current number of processed clauses  : 80
0.88/0.59	#    Positive orientable unit clauses  : 3
0.88/0.59	#    Positive unorientable unit clauses: 0
0.88/0.59	#    Negative unit clauses             : 1
0.88/0.59	#    Non-unit-clauses                  : 76
0.88/0.59	# Current number of unprocessed clauses: 563
0.88/0.59	# ...number of literals in the above   : 2913
0.88/0.59	# Current number of archived formulas  : 0
0.88/0.59	# Current number of archived clauses   : 19
0.88/0.59	# Clause-clause subsumption calls (NU) : 529
0.88/0.59	# Rec. Clause-clause subsumption calls : 130
0.88/0.59	# Non-unit clause-clause subsumptions  : 14
0.88/0.59	# Unit Clause-clause subsumption calls : 2
0.88/0.59	# Rewrite failures with RHS unbound    : 0
0.88/0.59	# BW rewrite match attempts            : 4
0.88/0.59	# BW rewrite match successes           : 0
0.88/0.59	# Condensation attempts                : 0
0.88/0.59	# Condensation successes               : 0
0.88/0.59	# Termbank termtop insertions          : 195687
0.88/0.59	# Search garbage collected termcells   : 522
0.88/0.59	
0.88/0.59	# -------------------------------------------------
0.88/0.59	# User time                : 0.076 s
0.88/0.59	# System time              : 0.007 s
0.88/0.59	# Total time               : 0.083 s
0.88/0.59	# Maximum resident set size: 1980 pages
0.88/0.59	
0.88/0.59	# -------------------------------------------------
0.88/0.59	# User time                : 0.379 s
0.88/0.59	# System time              : 0.025 s
0.88/0.59	# Total time               : 0.405 s
0.88/0.59	# Maximum resident set size: 1712 pages
0.88/0.59	% E---3.1 exiting
0.88/0.59	% E exiting
0.88/0.59	EOF